A Parallel Computation Approach to Topological Sorting
نویسنده
چکیده
A new topological sorting algorithm is formulated using the parallel computation approach. The time complexity of this algorithm is of the order of the longest distance between a source node and a sink node in an acyclic digraph representing the partial orderings between elements. An implementation of this algorithm with an SIMD machine is discussed. To avoid contention for logical resources, a synchronization of all processors is proposed and its performance is also discussed.
منابع مشابه
External Sorting for Databases in Distributed Heterogeneous Systems
A common approach to external parallel sorting in parallel database query processing is to split the data of initial runs into partitions. These partitions are assigned statically to the processes of the merge phase to produce a globally sorted result. This strategy may lead to low performance if some processes are overloaded caused by data skew or load imbalances. In this paper we describe a n...
متن کاملTopological Relations between Random Areal Objects within GIS
ABSTRACT There is inevitably error or uncertainty in spatial data, which are used to represent reality world, it will causes a suspicion for correctness of topological relations obtained by reasoning from observation data. In this paper, we firstly describe the geometric and statistical properties of areal object, and analyzing the effects of positional uncertainty on representation of topologi...
متن کاملParallel Sorting and Star-P Data Movement and Tree Flattening
This thesis studies three problems in the field of parallel computing. The first result provides a deterministic parallel sorting algorithm that empirically shows an improvement over two sample sort algorithms. When using a comparison sort, this algorithm is 1-optimal in both computation and communication. The second study develops some extensions to the Star-P system [7, 6] that allows it to s...
متن کاملA Memtic genetic algorithm for a redundancy allocation problem
Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...
متن کاملEmergent Computation by Catalytic Reactions
Recently, biochemical systems have been shown to possess interesting computational properties. In a parallel development, the chemical computation metaphor is becoming more and more frequently used as part of the emergent computation paradigm in Computer Science. We review in this contribution the idea behind the chemical computational metaphor and outline its relevance for nanotechnology. We s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. J.
دوره 26 شماره
صفحات -
تاریخ انتشار 1983